Exact Recovery with Symmetries for Procrustes Matching
نویسندگان
چکیده
منابع مشابه
Exact Recovery with Symmetries for Procrustes Matching
The Procrustes matching (PM) problem is the problem of finding the optimal rigid motion and labeling of two point sets so that they are as close as possible. Both rigid and non-rigid shape matching problems can be formulated as PM problems. Recently [14] presented a novel convex semi-definite programming relaxation (PM-SDP) for PM which achieves state of the art results on common shape matching...
متن کاملExact recovery with symmetries for the Doubly-Stochastic relaxation
Graph matching or quadratic assignment, is the problem of labeling the vertices of two graphs so that they are as similar as possible. A common method for approximately solving the NP-hard graph matching problem is relaxing it to a convex optimization problem over the set of doubly stochastic matrices. Recent analysis has shown that for almost all pairs of isomorphic and asymmetric graphs, the ...
متن کاملExact solutions for Fokker-Plank equation of geometric Brownian motion with Lie point symmetries
In this paper Lie symmetry analysis is applied to find new solution for Fokker Plank equation of geometric Brownian motion. This analysis classifies the solution format of the Fokker Plank equation.
متن کاملThe Softassign Procrustes Matching Algorithm
The problem of matching shapes parameterized as a set of points is frequently encountered in medical imaging tasks. When the point-sets are derived from landmarks, there is usually no problem of determining the correspondences or homologies between the two sets of landmarks. However, when the point sets are automatically derived from images, the diicult problem of establishing correspondence an...
متن کاملComplex Orthogonal Matching Pursuit and Its Exact Recovery Conditions
In this paper, we present new results on using orthogonal matching pursuit (OMP), to solve the sparse approximation problem over redundant dictionaries for complex cases (i.e., complex measurement vector, complex dictionary and complex additive white Gaussian noise (CAWGN)). A sufficient condition that OMP can recover the optimal representation of an exactly sparse signal in the complex cases i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Optimization
سال: 2017
ISSN: 1052-6234,1095-7189
DOI: 10.1137/16m1078628